Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover
نویسندگان
چکیده
The Distributed Larch Prover, DLP, is a distributed and parallel version of LP, an interactive prover. DLP helps users nd proofs by creating and managing many proof attempts that run in parallel. Parallel attempts may cooperate by working on diierent subgoals, and they may compete by using diierent inference methods to prove the same goal. DLP runs on a network of workstations.
منابع مشابه
Parallel User Interfaces for Parallel Applications
Many parallel applications are designed to conceal parallelism from the user. In this paper, we investigate a diierent approach where the user controls many tasks running in parallel. The idea is to let a user accomplish his goal more quickly by trying competing alternatives in parallel (or-parallelism) and by working on subgoals in parallel (and-parallelism). To help the user manage a large nu...
متن کاملMachine assisted proofs of properties of Avalon programs
Proving the correctness of programs by hand is hard and error-prone. How can mechanical theorem proving aids such as the Larch Prover (LP) help in the proofs of complex programs? We address this question by applying LP, a proof checker based on rewrite-rule theory, to the proof of an Avalon/C-Hprogram. Avalon/C++ is a programming language that supports concurrency and fault-tolerance through tr...
متن کاملTutorial on Design Verification with Synchronized Transitions
This tutorial describes a mechanized technique for design veriication. The aim is, in the early design phases, to verify selected key properties of a partially speciied design. A supporting design language called Synchronized Transitions is used for describing designs. The design veriication is mechanized by tools, in particular, a theorem prover called the Larch Prover (lp) used for reasoning ...
متن کاملTheorem proving using computational systems : The case of the
The framework of computational systems has been already used for describing several computational logics. In this paper is described the way a propositional prover and a predicate prover are implemented in ELAN, the system developed in Nancy for describing and executing computational systems. The inference rules for the provers are described by conditional rewrite rules and their application is...
متن کاملProving Theorems about Java and the JVM with ACL2
We describe a methodology for proving theorems mechanically about Java methods. The theorem prover used is the ACL2 system, an industrial-strength version of the Boyer-Moore theorem prover. An operational semantics for a substantial subset of the Java Virtual Machine (JVM) has been defined in ACL2. Theorems are proved about Java methods and classes by compiling them with javac and then proving ...
متن کامل